3 0 Ju n 20 09 GROUP THEORY IN CRYPTOGRAPHY

نویسندگان

  • SIMON R. BLACKBURN
  • CARLOS CID
  • CIARAN MULLAN
چکیده

This paper is a guide for the pure mathematician who would like to know more about cryptography based on group theory. The paper gives a brief overview of the subject, and provides pointers to good textbooks, key research papers and recent survey papers in the area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 5 Ju n 20 09 COMPLETIONS OF HIGHER EQUIVARIANT K - THEORY

For a linear algebraic group G acting on a smooth variety X over an algebraically closed field k of characteristic zero, we prove a version of nonabelian localization theorem for the rational higher equivariant K-theory of X . This is then used to establish a Riemann-Roch theorem for the completion of the rational higher equivariant K-theory at a maximal ideal of the representation ring of G.

متن کامل

3 0 Ju n 20 09 Classification of commutative algebras and tube realizations of hyperquadrics

In this paper we classify up to affine equivalence all local tube realizations of real hyper-quadrics in C n. We show that this problem can be reduced to the classification, up to isomorphism, of commutative nilpotent real and complex algebras. We also develop some structure theory for com-mutative nilpotent algebras over arbitrary fields of characteristic zero.

متن کامل

ar X iv : 0 80 9 . 15 36 v 2 [ m at h . D G ] 1 5 Ju n 20 09 Tight Lagrangian surfaces in S 2 × S 2 ∗ Hiroshi

We determine all tight Lagrangian surfaces in S2×S2. In particular, globally tight Lagrangian surfaces in S2 × S2 are nothing but real forms.

متن کامل

2 0 Ju n 20 09 TERNARY QUADRATIC FORMS , MODULAR EQUATIONS AND CERTAIN POSITIVITY CONJECTURES

We show that many of Ramanujan’s modular equations of degree 3 can be interpreted in terms of integral ternary quadratic forms. This way we establish that for any n ∈ N

متن کامل

ar X iv : 0 90 6 . 18 57 v 1 [ m at h . C O ] 1 0 Ju n 20 09 On the circumference , connectivity and dominating cycles

Every 4-connected graph with minimum degree δ and connectivity κ either has a cycle of length at least 4δ − 2κ or has a dominating cycle.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009